#include<iostream>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_set>
#include<bits/stdc++.h>
#define fi first
#define se second
#define SIZE(x) ((int)x.size())
#define out(x) cerr<<#x<<" = "<<(x)<<endl;
#define MP(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
#define VI vector<int>
#define VVI vector< vector<int> >
#define VD vector<double>
#define VVD vector<VD >
#define VC vector<char>
#define PI pair<int,int>
#define PL pair<ll,ll>
#define EPS 0.0000001


inline int lson(int x){return x<<1;}
inline int rson(int x){return (x<<1)|1;}

inline int read()
{
        int x=0,f=1;char ch=getchar();
        while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
        while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
        return x*f;
}

template<typename T>
inline void read(T &x){
        x=0;T f=1;char ch;
        do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
        do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

int n;
vector<vector<double> > mat;

int main(){
    #ifdef BUG
    freopen("a.in","r",stdin);
    #endif
    n=read();
    mat=VVD(n,VD(n+1));
    for(int i=0;i<n;i++)
      for(int j=0;j<=n;j++)
        read(mat[i][j]);
    for(int i=0;i<n;i++){
      int pos=i;
      for(int j=i+1;j<n;j++)if(abs(mat[pos][i])<abs(mat[j][i]))pos=j;
      swap(mat[i],mat[pos]);
      if(abs(mat[i][i])<EPS){
        cout<<"No Solution\n";
        return 0;
      }
      for(int j=0;j<=n;j++)if(j!=i)mat[i][j]/=mat[i][i];
      for(int j=0;j<n;j++){
        if(j==i)continue;
        for(int k=i+1;k<=n;k++){
          mat[j][k]-=mat[j][i]*mat[i][k];
        }
      }
    }
    for(int i=0;i<n;i++)printf("%.2f\n",mat[i][n]);
}